8 research outputs found

    Custom Integrated Circuits

    Get PDF
    Contains reports on ten research projects.Analog Devices, Inc.IBM CorporationNational Science Foundation/Defense Advanced Research Projects Agency Grant MIP 88-14612Analog Devices Career Development Assistant ProfessorshipU.S. Navy - Office of Naval Research Contract N0014-87-K-0825AT&TDigital Equipment CorporationNational Science Foundation Grant MIP 88-5876

    A numerical engine for distributed sparse matrices

    No full text
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.Includes bibliographical references (p. 169-173).by Ricardo Telichevesky.Ph.D

    Efficient Steady-State Analysis Based on Matrix-Free Krylov-Subspace Methods

    Full text link

    Efficient AC and Noise Analysis of Two-Tone RF Circuits

    No full text
    In this paper we present a preconditioned recycled Krylov-subspace method to accelerate a recently developed approach for AC and noise analysis of linear periodically-varying communication circuits. Examples are given to show that the combined method can be used to analyze switching filter frequency response, mixer 1/f noise frequency translation, and amplifier intermodulation distortion. In addition, it is shown that for large circuits the pre-conditioned recycled Krylov-subspace method is up to forty times faster than the standard optimized direct methods

    Efficient Steady-State Analysis based on Matrix-Free Krylov-Subspace Methods

    No full text
    Gaussian-elimination based shooting-Newton methods, a commonly used approach for computing steady-state solutions, grow in computational complexity like N³ where N is the number of circuit equations. Just using iterative methods to solve the shooting-Newton equations results in an algorithm which is still order N because of the cost of calculating the dense sensitivity matrix. Below, a matrix-free Krylov-subspace approach is presented, and the method is shown to reduce shooting-Newton computational complexity to that of ordinary transient analysis. Results from several examples are given to demonstrate that the matrix-free approach is more than ten times faster than using iterative methods alone for circuits with as few as 400 equations
    corecore